Eigenfunctions with few critical points

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single Nucleotide Polymorphisms and Association Studies: A Few Critical Points

Uncovering DNA sequence variations that correlate with phenotypic changes, e.g., diseases, is the aim of sequence variation studies. Common types sequence variations are Single nucleotide polymorphism (SNP, pronounced snip).SNPs are the third-generation molecular marker. SNP represents a DNA sequence variant of a single base pair with the minor allele occurring in more than 1% of a given popula...

متن کامل

Lattice 3-Polytopes with Few Lattice Points

This paper is intended as a first step in a program for a full algorithmic enumeration of lattice 3-polytopes. The program is based in the following two facts, that we prove: • For each n there is only a finite number of (equivalence classes of) 3polytopes of lattice width larger than one, where n is the number of lattice points. Polytopes of width one are infinitely many, but easy to classify....

متن کامل

Generalized Eigenfunctions for critical potentials with small perturbations

We estimate the behavior of the generalized eigenfunctions of critical Dirac operators (which are Dirac operators with eigenfunctions and/or resonances for E = m) under small perturbations in the potential. The results also apply for other differential operators (for example Schrödinger operators).

متن کامل

Colour-critical graphs with few edges

A graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chromatic number at most k 1. In this paper the following result is proved. If G is a k-critical graph (k>~4) on n vertices, then 21E(G)I>(k 1)n ÷ ((k 3)/(k 2 3))n + k 4 where n>~k + 2 and n ~ 2 k 1. This improves earlier bounds established by Dirac (1957) and Gallai (1963). (~) 1998 Elsevier Science B.V. All ...

متن کامل

Group Automorphisms with Few and with Many Periodic Points

For any C ∈ [0,∞] a compact group automorphism T : X → X is constructed with the property that 1 n log |{x ∈ X | T n(x) = x}| −→ C. This may be interpreted as a combinatorial analogue of the (still open) problem of whether compact group automorphisms exist with any given topological entropy.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Differential Geometry

سال: 1999

ISSN: 0022-040X

DOI: 10.4310/jdg/1214425450